#include <iostream>

using namespace std;
int maps[105][105]={0};
int m,k;
int main(){
	int n,cnt=0;
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		int x,y;
		cin>>x>>y;
		
		//
		for(int j=1;j<=5;j++){
			int nx=x;
			int ny=y-3+j;
			if(ny>=1&&ny<=n){
				maps[nx][ny]=1;
			}
			nx=x-3+j;
			ny=y;
			if(nx>=1&&nx<=n){
				maps[nx][ny]=1;
			}
		}
		
		if(x-1>=1&&y-1>=1) maps[x-1][y-1]=1;
		if(x-1>=1&&y+1<=n) maps[x-1][y+1]=1;
		if(x+1<=n&&y-1>=1) maps[x+1][y-1]=1;
		if(x+1<=n&&y+1<=n) maps[x+1][y+1]=1;
	}
	
	for(int i=1;i<=k;i++){
		int x,y;
		cin>>x>>y;
		
		for(int j=1;j<=5;j++){
			for(int k=1;k<=5;k++){
				int nx=x-3+j;
				int ny=y-3+k;
				if(nx>=1&&nx<=n&&ny>=1&&ny<=n){
					maps[nx][ny]=1;
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
		//	cout<<maps[i][j]<<" ";
			if(!maps[i][j]) cnt++;	
		}
		//cout<<endl;
	}
	cout<<cnt;
	return 0;
}
